A Conversion Procedure for NNC Polyhedra

نویسندگان

  • Anna Becchi
  • Enea Zaffanella
چکیده

We present an alternative Double Description representation for the domain of NNC (not necessarily topologically closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation differs from the ones adopted in the currently available implementations of the Double Description method in that it uses no slack variable at all: this new approach provides a solution to a few technical issues caused by the encoding of an NNC polyhedron as a closed polyhedron in a higher dimension space. A preliminary experimental evaluation shows that the new conversion algorithm is able to achieve significant efficiency improvements with respect to state-of-theart implementations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Under consideration for publication in Formal Aspects of Computing Not Necessarily Closed Convex Polyhedra and the Double Description Method

Since the seminal work of Cousot and Halbwachs, the domain of convex polyhedra has been employed in several systems for the analysis and verification of hardware and software components. Although most implementations of the polyhedral operations assume that the polyhedra are topologically closed (i.e., all the constraints defining them are non-strict), several analyzers and verifiers need to co...

متن کامل

A New Encoding and Implementation of Not Necessarily Closed Convex Polyhedra

Convex polyhedra, commonly employed for the analysis and verification of both hardware and software, may be defined either by a finite set of linear inequality constraints or by finite sets of generating points and rays of the polyhedron. Although most implementations of the polyhedral operations assume that the polyhedra are topologically closed (i.e., all the constraints defining them are non...

متن کامل

A New Encoding of Not Necessarily Closed Convex Polyhedra

Many applications of static analysis and verification compute on some abstract domain based on convex polyhedra. Traditionally, most of these applications are restricted to convex polyhedra that are topologically closed. When adopting the Double Description (DD) method [8], a closed convex polyhedron can be specified in two ways, using a constraint system or a generator system: the constraint s...

متن کامل

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

The domain of convex polyhedra is employed in several systems for the analysis and verification of hardware and software components. Current applications span imperative, functional and logic languages, synchronous languages and synchronization protocols, real-time and hybrid systems. Since the seminal work of P. Cousot and N. Halbwachs, convex polyhedra have thus played an important role in th...

متن کامل

Neem-silicone lotion and ultrasound nit comb: a randomised, controlled clinical trial treating head louse infestation

Background: A neem-based conditioner lotion (ONC) used against head lice was previously tested clinically and shown to be relatively ineffective. To improve the activity against lice and their eggs, it was reformulated into a silicone vehicle (NNC) as part of a project to improve pediculicidal medical devices. An ultrasound nit comb was also developed to be used in conjunction with the neem lot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1711.09593  شماره 

صفحات  -

تاریخ انتشار 2017